Continuous time vertex-reinforced jump processes
نویسندگان
چکیده
منابع مشابه
Limit theorems for vertex-reinforced jump processes on regular trees
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b children, with b ≥ 3. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertexreinforced jump process is transient on the binary tree.
متن کاملHow Vertex reinforced jump process arises naturally
We prove that the only nearest neighbor jump process with local dependence on the occupation times satisfying the partially exchangeable property is the vertex reinforced jump process, under some technical conditions (Theorem 4). This result gives a counterpart to the characterization of edge reinforced random walk given by Rolles [9].
متن کامل9 Limit Theorems for Vertex - Reinforced Jump Processes on Regular Trees
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b children, with b ≥ 3. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertex-reinforced jump process is transient on the binary tree. Dipartimento di Matematica applicata, Università Ca’ Fosc...
متن کاملApproximate inference in continuous time Gaussian-Jump processes
We present a novel approach to inference in conditionally Gaussian continuous time stochastic processes, where the latent process is a Markovian jump process. We first consider the case of jump-diffusion processes, where the drift of a linear stochastic differential equation can jump at arbitrary time points. We derive partial differential equations for exact inference and present a very effici...
متن کاملEdge-reinforced random walk, Vertex-Reinforced Jump Process and the supersymmetric hyperbolic sigma model
Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986 [5], is a random process that takes values in the vertex set of a graph G, which is more likely to cross edges it has visited before. We show that it can be interpreted as an annealed version of the Vertex-reinforced jump process (VRJP), conceived by Werner and first studied by Davis and Volkov [7, 8], a continuo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2002
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s004400100189